背包问题，从m个物品中选出某几个，在背包的承重范围内使得背包的价值的最大-Knapsack problem, a few selected from the m items, making the value of the backpack in the backpack load-bearing within

acm动态规划背包问题详解一共有九讲，非常非常的实用-acm dynamic programming knapsack problem Elaborates a total of nine speakers, very very practical